An effective hybrid search mode for multi-objective optimization with constraints

نویسندگان

چکیده

In this paper a new search strategy for multi-objective optimization (MOO) with constraints is proposed based on hybrid mode (HSM). The processes feasible solutions and optimal are executed in mixed way the existing methods. With regard to HSM, proposed, which consists of two processes: Feasibility (FSM) (OSM). executions these modes independent relatively also adjusted according population distribution. early stage, FSM plays leading role exploring space since most individuals infeasible. increase individuals, OSM primary operation individuals. method simple implement need few extra parameter tuning. handing tested several problems constraints. remarkable results demonstrate its effectiveness good performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predictive Entropy Search for Multi-objective Bayesian Optimization with Constraints

This work presents PESMOC, Predictive Entropy Search for Multi-objective Bayesian Optimization with Constraints, an information-based strategy for the simultaneous optimization of multiple expensive-to-evaluate black-box functions under the presence of several constraints. PESMOC can hence be used to solve a wide range of optimization problems. Iteratively, PESMOC chooses an input location on w...

متن کامل

An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems

This paper proposes an effective hybrid tabu search algorithm (HTSA) to solve the flexible job-shop scheduling problem. Three minimization objectives – the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously. In this study, a tabu search (TS) algorithmwith an effective neighborhood structure combining two adap...

متن کامل

An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems

Scheduling for the flexible job-shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. Particle swa...

متن کامل

An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.07.021 * Corresponding author. E-mail address: [email protected] (X. Shao). Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the monoobjective FJSP. However, they are very d...

متن کامل

Beam Search for integer multi-objective optimization

Beam search is a tree search procedure where, at each level of the tree, at most w nodes are kept. This results in a metaheuristic whose solving time is polynomial in w. Popular for single-objective problems, beam search has only received little attention in the context of multi-objective optimization. By introducing the concepts of oracle and filter, we define a paradigm to understand multi-ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MATEC web of conferences

سال: 2022

ISSN: ['2261-236X', '2274-7214']

DOI: https://doi.org/10.1051/matecconf/202235502008